#include<iostream>
#include<stack>
#include<queue>
#include"priority_queue.h"
using namespace bit;
int main() {
	bit::priority_queue<int, vector<int>, less<int>> pq;
	pq.push(1);
	pq.push(2);
	pq.push(3);

	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;
	return 0;
}